Using Symbolic Simulation for Bounded Property Checking

نویسندگان

  • Jürgen Ruf
  • Prakash Mohan Peranandam
  • Thomas Kropf
  • Wolfgang Rosenstiel
چکیده

Assuring correctness of digital designs is one of the major tasks in the system design flow. Formal methods have been proposed to accompany commonly used simulation approaches. In this paper we describe a new technique of property checking using symbolic simulation which can be applied to larger designs. This technique seamlessly integrate formal verification and standard simulation. The proposed method is a formal verification technique which checks symbolically a given LTL specification against the Hardware Design. Our experimental results show a run time gain over standard symbolic model checking and SAT-based bounded model checking for certain classes of circuits and properties.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounded Property Checking with Symbolic Simulation

Steadily increasing design sizes, make the verification a bottleneck in modern design flows of digital hardware and embedded software systems. Up to 75% of the overall design costs are due to the verification task. Formal methods have been proposed to accompany commonly used simulation approaches. In this paper we combine property checking and symbolic simulation to make these techniques applic...

متن کامل

Experiments with SAT-Based Symbolic Simulation Using Reparameterization in the Abstraction Refinement Framework

This paper presents experimental results on the performance effect of using symbolic simulation with SAT-based reparametrization within the Counterexample Guided Abstraction Refinement framework. Abstraction refinement has been applied successfully to prove safety properties of large industrial circuits. However, all existing abstraction refinement frameworks simply use SAT-based Bounded Model ...

متن کامل

Model Checking Gene Regulatory Networks

The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight p...

متن کامل

A methodology for validation of microprocessors using symbolic simulation

Functional validation is one of the most complex and expensive tasks in the current processor design methodology. A significant bottleneck in the validation of processors is the lack of a golden reference model. Thus, many existing approaches employ a bottom-up methodology by using a combination of simulation techniques and formal methods. We present a top-down validation approach using a langu...

متن کامل

Symbolic Analysis of GSMP Models With One Stateful Clock

We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based techniques for GSMPs are not adequate for solving verification problems, and existing symbolic techniques either require memoryless distributions for firing times, or approximate the problem using discrete time or bounde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003